Efficient Tag Grouping RFID Anti-Collision Algorithm for Internet of Things Applications Based on Improved K-Means Clustering

Dynamic Frame Slotted ALOHA (DFSA) is a de facto algorithm in the EPC Global Class-1 Generation-2 protocol for Radio Frequency Identification (RFID) tag collision problem. DFSA fails when UHF RFID deployment becomes dense like Internet of Things (IoT). Existing works do not provide readers prior estimates. Most algorithms assume slot means two collision. But IoT applications, much more than tags can constitute slot. Moreover, research proves might occur due to other reasons such as error-prone channel. This paper proposes anti-collision algorithm, kg-DFSA that equips reader with information on accurate estimate. In kg-DFSA, identification divided into stages – initialization and identification. stage, uses improved K-means clustering running concurrently counter cluster K groups using tags’ RN16 while returns an number are read only frame chunks match their group IDs new size look up table developed boost efficiency. Variants proposed traditional another grouping based (FCM-DFSA) were implemented MATLAB. Extensive Monte Carlo simulation shows edges terms success rate 50%, system efficiency 65% time 28%. The model useful enhancing existing MAC support RFID.